/*
Problem Description
Message queue is the basic fundamental of windows system. For each process, the system maintains a message queue. If something happens to this process, such as mouse click, text change, the system will add a message to the queue. Meanwhile, the process will do a loop for getting message from the queue according to the priority value if it is not empty. Note that the less priority value means the higher priority. In this problem, you are asked to simulate the message queue for putting messages to and getting message from the message queue.
Input
There's only one test case in the input. Each line is a command, "GET" or "PUT", which means getting message or putting message. If the command is "PUT", there're one string means the message name and two integer means the parameter and priority followed by. There will be at most 60000 command. Note that one message can appear twice or more and if two messages have the same priority, the one comes first will be processed first.(i.e., FIFO for the same priority.) Process to the end-of-file.
Output
For each "GET" command, output the command getting from the message queue with the name and parameter in one line. If there's no message in the queue, output "EMPTY QUEUE!". There's no output for "PUT" command.
Sample Input
GET
PUT msg1 10 5
PUT msg2 10 4
GET
GET
GET
Sample Output
EMPTY QUEUE!
msg2 10
msg1 10
EMPTY QUEUE!
------------------------------------------------------------
 题目大意是给出优先级，对文件进行操作，按照优先级输出，没有优先级的话，按照FIFO的顺序输出（临时把队列变成栈了……）
 */
package com.yuan.algorithms.training20150721;

import java.util.Comparator;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;

class Passenger {
	private String name;//消息名称
	private int parameter;//参数
	private int PRI;//优先级
	private int index;//记录消息是第几个输入
	
	public Passenger(String name, int parameter, int pri) {
		this.name = name;
		this.parameter = parameter;
		this.PRI = pri;
	}
	public String getName() {
		return name;
	}
	public int getParameter() {
		return parameter;
	}
	public int getPRI() {
		return PRI;
	}
	public int getIndex() {
		return index;
	}
	public void setIndex(int index) {
		this.index = index;
	}
	public String toString() {
		return getName() + " " + getParameter();
	}
}

public class 优先队列_windows消息队列 {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		Comparator<Passenger> sort = new Comparator<Passenger>() {

			@Override
			public int compare(Passenger o1, Passenger o2) {
				//pri越大的优先级越小
				if (o1.getPRI() != o2.getPRI()) {
					if (o1.getPRI() > o2.getPRI()) {
						return 1;
					} else if (o1.getPRI() < o2.getPRI()) {
						return -1;
					}
				}
				//相等情况下，index越大的优先级越小  
				if (o1.getIndex()>o2.getIndex()) {
					return 1;
				}else {
					return -1;
				}
			}
		};
		Queue<Passenger> queue = new PriorityQueue<Passenger>(sort);
		int k = 0;
		while (sc.hasNext()) {
			String order = sc.next();
			if (order.equals("PUT")) {
				String name = sc.next();
				int parameter = sc.nextInt();
				int PRI = sc.nextInt();
				Passenger e = new Passenger(name, parameter, PRI);
				e.setIndex(++k);
				queue.add(e);
			} else {
				if (!queue.isEmpty()) {
					Passenger t = queue.poll();
					System.out.println(t.toString());
				} else {
					System.out.println("EMPTY QUEUE!");
				}
			}
		}
	}

}
